Analytic representations of polycyclic groups
نویسندگان
چکیده
منابع مشابه
On Induced Locally Analytic Representations of Locally Analytic Groups
Let G be a locally analytic group and H ⊂ G a locally analytic subgroup. The main result is the condition (similar to Frommer-Orlik-Strauch theorem) for induction of locally analytic H-representation to G to be irreducible. Also this paper contains a (new) series of locally analytic representations which do not arise in this way.
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملA Practical Algorithm for Finding Matrix Representations for Polycyclic Groups
We describe a new algorithm for nding matrix representations for polycyclic groups given by nite presentations. In contrast to previous algorithms, our algorithm is e cient enough to construct representations for some interesting examples. The examples which we studied included a collection of free nilpotent groups, and our results here led us to a theoretical result concerning such groups.
متن کاملZETA FUNCTION OF REPRESENTATIONS OF COMPACT p-ADIC ANALYTIC GROUPS
Let G be a profinite group. We denote by rn(G) the number of isomorphism classes of irreducible n-dimensional complex continuous representations of G (so that the kernel is open in G). Following [20], we call rn(G) the representation growth function of G. If G is a finitely generated profinite group, then rn(G) < ∞ for every n if and only if G has the property FAb (that is, H/[H,H] is finite fo...
متن کاملGeneration of polycyclic groups
Polycyclic groups are one of the best understood class of groups. For example most of the decision problems are decidable in this class, see [7]. It seems surprising therefore that it is still an open problem whether there exists an algorithm which finds d(G) for any polycyclic group G (given by say a set of generators and relations). This is unknown even in the case when G is virtually abelian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1982
ISSN: 0021-8693
DOI: 10.1016/0021-8693(82)90011-4